Capacitated network design using general flow-cutset inequalities
نویسندگان
چکیده
This paper deals with directed, bidirected, and undirected capacitated network design problems. Using mixed integer rounding (MIR), we generalize flow-cutset inequalities to these three link types and to an arbitrary modular link capacity structure, and propose a generic separation algorithm. In an extensive computational study on 54 instances from the Survivable Network Design Library (SNDlib), we show that the performance of Cplex can significantly be enhanced by this class of cutting planes. The computations reveal the particular importance of the subclass of cutset inequalities.
منابع مشابه
On cut-based inequalities for capacitated network design polyhedra
In this article we study capacitated network design problems. We unify and extend poly-hedral results for directed, bidirected and undirected link capacity models. Based on validinequalities for a network cut we show that regardless of the link capacity model, facets of thepolyhedra associated with such a cut translate to facets of the original network design polyhedraif the...
متن کاملMetric inequalities, cutset inequalities and Benders feasibility cuts for multicommodity capacitated network design
Metric inequalities, cutset inequalities and Benders feasibility cuts are three families of valid inequalities that have been widely used in different algorithms for network design problems. This article sheds some light on the interrelations between these three families of inequalities. In particular, we show that cutset inequalities are a subset of the Benders feasibility cuts, and that Bende...
متن کاملBenders, metric and cutset inequalities for multicommodity capacitated network design
Solving multicommodity capacitated network design problems is a hard task that requires the use of several strategies like relaxing some constraints and strengthening the model with valid inequalities. In this paper, we compare three sets of inequalities that have been widely used in this context: Benders, metric and cutset inequalities. We show that Benders inequalities associated to extreme r...
متن کاملOn the strength of cut-based inequalities for capacitated network design polyhedra
In this paper we study capacitated network design problems, differentiating directed, bidirected and undirected link capacity models. We complement existing polyhedral results for the three variants by new classes of facet-defining valid inequalities and unified lifting results. For this, we study the restriction of the problems to a cut of the network. First, we show that facets of the resulti...
متن کاملA cutting-plane algorithm based on cutset inequalities for multicommodity capacitated fixed charge network design
The multicommodity capacitated fixed charge network design problem is a well-known NPhard problem which arises in a wide variety of applications, most notably in transportation and telecommunications. In this paper, we propose to improve the mixed integer programming (MIP) formulation of the problem by using a polyhedral approach. We present a cutting-plane algorithm which incorporates valid in...
متن کامل